Formalising Overlap Algebras in Matita

نویسندگان

  • Claudio Sacerdoti Coen
  • Enrico Tassi
چکیده

We describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that they also ease the formalization of formal topological results in an interactive theorem prover. Our main result is the existence of a functor between two categories of ‘generalized topological spaces’, one with points (Basic Pairs) and the other point-free (Basic Topologies). The reported formalization is part as a wider scientific collaboration with the inventor of the theory, Giovanni Sambin. His goal is to verify in what sense, and with what difficulties, his theory is ‘implementable’. We check that all intermediate constructions respect the stringent size requirements imposed by predicative logic. The formalization is quite unusual, since it has to make explicit size information that is often hidden. We found that the version of Matita used for the formalization was largely inappropriate. The formalization drove several major improvements of Matita that will be integrated in the next major release (Matita 1.0). We show some motivating examples for these improvements, taken directly from the formalization. We also describe a possibly sub-optimal solution in Matita 1/2, exploitable in other similar systems. We briefly discuss a better solution available in Matita 1.0.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita

The project entitled " Formalization of Formal Topology by means of the interactive theorem prover Matita " is an official bilateral project between the Universities of Padova and Bologna, funded by the former, active ¡¡¡¡¡¡¡ .mine from march 2008 until august 2010. The project brought together and exploited the synergic collaboration of two communities of researchers, both centered around cons...

متن کامل

Matita Tutorial

0 Getting Started 94 0.1 Installing Matita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94 0.2 Preparing a working directory . . . . . . . . . . . . . . . . . . . . . . 95 0.3 Matita interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 0.4 Browsing the library . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 0.5 Live DVD . . . . . . . . . . . . . . . . ....

متن کامل

Natural Deduction Environment for Matita

Matita is a proof assistant characterised by a rich, user extensible, output facility based on a widget for the rendering of MathML Presentation, and by the automatic handling of overloading by means of a flexible disambiguation mechanism. We show how to use these features to obtain a simple learning environment for natural deduction, without modifying the source code or Matita.

متن کامل

An Efficient Coq Tactic for Deciding Kleene Algebras

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously. The corresponding decision procedure was proved correct and complete; correctness is established w.r.t. any model (including binary relati...

متن کامل

User interaction widgets for interactive theorem proving

Matita (that means pencil in Italian) is a new interactive theorem prover under development at the University of Bologna. When compared with state-of-the-art proof assistants, Matita presents both traditional and innovative aspects. The underlying calculus of the system, namely the Calculus of (Co)Inductive Constructions (CIC for short), is well-known and is used as the basis of another mainstr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011